Variations on undirected graphical models and their relationships
نویسندگان
چکیده
We compare alternative definitions of undirected graphical models for discrete, finite variables. Lauritzen [7] provides several definitions of such models and describes their relationships. He shows that the definitions agree only when joint distributions represented by the models are limited to strictly positive distributions. Heckerman et al. [6], in their paper on dependency networks, describe another definition of undirected graphical models for strictly positive distributions. They show that this definition agrees with those of Lauritzen [7] again when distributions are strictly positive. In this paper, we extend the definition of Heckerman et al. [6] to arbitrary distributions and show how this definition relates to those of Lauritzen [7] in the general case.
منابع مشابه
Neural Variational Inference and Learning in Undirected Graphical Models
Many problems in machine learning are naturally expressed in the language of undirected graphical models. Here, we propose black-box learning and inference algorithms for undirected models that optimize a variational approximation to the log-likelihood of the model. Central to our approach is an upper bound on the logpartition function parametrized by a function q that we express as a flexible ...
متن کاملBayesian Learning in Undirected Graphical Models: Approximate MCMC Algorithms
Bayesian learning in undirected graphical models—computing posterior distributions over parameters and predictive quantities— is exceptionally difficult. We conjecture that for general undirected models, there are no tractable MCMC (Markov Chain Monte Carlo) schemes giving the correct equilibrium distribution over parameters. While this intractability, due to the partition function, is familiar...
متن کاملVariational Inference for Sparse and Undirected Models
Undirected graphical models are applied in genomics, protein structure prediction, and neuroscience to identify sparse interactions that underlie discrete data. Although Bayesian methods for inference would be favorable in these contexts, they are rarely used because they require doubly intractable Monte Carlo sampling. Here, we develop a framework for scalable Bayesian inference of discrete un...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Standard Imsets for Undirected and Chain Graphical Models
We derive standard imsets for undirected graphical models and chain graphical models. Standard imsets for undirected graphical models are described in terms of minimal triangulations for maximal prime subgraphs of the undirected graphs. For describing standard imsets for chain graphical models, we first define a triangulation of a chain graph. We then use the triangulation to generalize our res...
متن کاملChain Graphs : Interpretations, Expressiveness and Learning Algorithms
Probabilistic graphical models are currently one of the most commonly used architectures for modelling and reasoning with uncertainty. The most widely used subclass of these models is directed acyclic graphs, also known as Bayesian networks, which are used in a wide range of applications both in research and industry. Directed acyclic graphs do, however, have a major limitation, which is that o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Kybernetika
دوره 50 شماره
صفحات -
تاریخ انتشار 2014